Bregman operator splitting with variable stepsize for total variation image reconstruction
نویسندگان
چکیده
This paper develops a Bregman operator splitting algorithm with variable stepsize (BOSVS) for solving problems of the form min{φ(Bu)+ 1/2‖Au− f ‖2}, where φ may be nonsmooth. The original Bregman Operator Splitting (BOS) algorithm employed a fixed stepsize, while BOSVS uses a line search to achieve better efficiency. These schemes are applicable to total variation (TV)-based image reconstruction. The stepsize rule starts with a Barzilai-Borwein (BB) step, and increases the nominal step until a termination condition is satisfied. The stepsize rule is related This research was partly supported by National Science Foundation grants 1115568 and 1016204, and by Office of Naval Research grant N00014-11-1-0068. Y. Chen · W.W. Hager · M. Yashtini ( ) Department of Mathematics, University of Florida, P.O. Box 118105, Gainesville, FL 32611-8105, USA e-mail: [email protected] url: http://www.math.ufl.edu/~myashtini Y. Chen e-mail: [email protected] url: http://www.math.ufl.edu/~yun W.W. Hager e-mail: [email protected] url: http://www.math.ufl.edu/~hager X. Ye School of Mathematics, Georgia Institute of Technology, 686 Cherry Street, Atlanta, GA 30332-0160, USA e-mail: [email protected] url: http://people.math.gatech.edu/~xye33 H. Zhang Department of Mathematics, Louisiana State University, Baton Rouge, LA 70803-4918, USA e-mail: [email protected] url: https://www.math.lsu.edu/~hozhang
منابع مشابه
An $\mathcal O(1/{k})$ Convergence Rate for the Variable Stepsize Bregman Operator Splitting Algorithm
An earlier paper proved the convergence of a variable stepsize Bregman operator splitting algorithm (BOSVS) for minimizing φ(Bu) + H(u), where H and φ are convex functions, and φ is possibly nonsmooth. The algorithm was shown to be relatively efficient when applied to partially parallel magnetic resonance image reconstruction problems. In this paper, the convergence rate of BOSVS is analyzed. W...
متن کاملAn O(1/k) Convergence Rate for the Variable Stepsize Bregman Operator Splitting Algorithm
Abstract. An earlier paper proved the convergence of a variable stepsize Bregman operator splitting algorithm (BOSVS) for minimizing φ(Bu) + H(u) where H and φ are convex functions, and φ is possibly nonsmooth. The algorithm was shown to be relatively efficient when applied to partially parallel magnetic resonance image reconstruction problems. In this paper, the convergence rate of BOSVS is an...
متن کاملAccelerated Bregman Operator Splitting with Backtracking
This paper develops two accelerated Bregman Operator Splitting (BOS) algorithms with backtracking for solving regularized large-scale linear inverse problems, where the regularization term may not be smooth. The first algorithm improves the rate of convergence for BOSVS [5] in terms of the smooth component in the objective function by incorporating Nesterov’s multi-step acceleration scheme unde...
متن کاملReconstruction for 3D PET Based on Total Variation Constrained Direct Fourier Method
This paper presents a total variation (TV) regularized reconstruction algorithm for 3D positron emission tomography (PET). The proposed method first employs the Fourier rebinning algorithm (FORE), rebinning the 3D data into a stack of ordinary 2D data sets as sinogram data. Then, the resulted 2D sinogram are ready to be reconstructed by conventional 2D reconstruction algorithms. Given the local...
متن کاملImage Restoration by Variable Splitting based on Total Variant Regularizer
The aim of image restoration is to obtain a higher quality desired image from a degraded image. In this strategy, an image inpainting method fills the degraded or lost area of the image by appropriate information. This is performed in such a way so that the obtained image is undistinguishable for a casual person who is unfamiliar with the original image. In this paper, different images are degr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Comp. Opt. and Appl.
دوره 54 شماره
صفحات -
تاریخ انتشار 2013